Implementing and Analyzing an Efficient Version of Counting Sort (E-Counting Sort)
نویسندگان
چکیده
منابع مشابه
Space Optimization of Counting Sort
Optimization of sorting algorithms is an ongoing research and delivers faster and less space consuming algorithms. The Counting sort algorithm is an integer sorting algorithm and is a very simple and effective way to sort numbers based on their key value. It uses three arrays for computation but in a large input set it can consume a significant amount of memory. This paper puts forward a method...
متن کاملCounting-Sort and Routing in a Single Hop Radio Network
We consider two problems. First, sorting of n integer keys from the [0, 2 − 1] range, stored in p stations of a single-hop and single channel radio network. Second problem is routing of the packets between the stations of the network. We introduce counting-sort algorithm which has 3mri + si + di + 3 energetic cost and nm + n + p time cost, where station ai stores si keys (ri distinct keys) and ...
متن کاملImplementing Bead-Sort with P Systems
Abstract. In this paper, we implement Bead–Sort, a natural sorting algorithm we introduced in [1], with the new, biochemically inspired P systems. In Bead–Sort, positive integers are represented by a set of beads (like those used in an Abacus). The beads representing integers to be sorted are allowed to slide through the rods of the Abacus. In this process, the smaller “numbers” always emerge a...
متن کاملA New Efficient Radix Sort
We present new improved algorithms for the sorting problem. The algorithms are not only efficient but also clear and simple. First, we introduce Forward Radix Sort which combines the advantages of traditional left-to-right and right-to-left radix sort in a simple manner. We argue that this algorithm will work very well in practice. Adding a preprocessing step, we obtain an algorithm with attrac...
متن کاملEfficient unbalanced merge – sort q
Sorting algorithms based on successive merging of ordered subsequences are widely used, due to their efficiency and to their intrinsically parallelizable structure. Among them, the merge–sort algorithm emerges indisputably as the most prominent method. In this paper we present a variant of merge–sort that proceeds through arbitrary merges between pairs of quasi-ordered subsequences, no matter w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/17208-7427